Split Cuts in the Plane
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 10 March 2020Accepted: 21 October 2020Published online: January 2021Keywordsinteger programming, cutting planes, split cutsAMS Subject Headings90C10, 90C57Publication DataISSN (print): 1052-6234ISSN (online): 1095-7189Publisher: Society for Industrial and Applied MathematicsCODEN: sjope8
منابع مشابه
Dynamic ham-sandwich cuts in the plane
We design efficient data structures for dynamically maintaining a ham-sandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A hamsandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our first data structure supports each operation in O(n) amortized time and O(n) space. Our second data st...
متن کاملSplit Closure and Intersection Cuts
In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these cuts can be obtained by a closed form formula from a basis of the standard linear programming relaxation. In the early nineties, Cook, Kannan and Schrijver introduced the split closure of an MILP, and showed that the split closure is a polyhedron. In this paper, we show that the...
متن کاملMultiple Cuts in Separating Plane Algorithms
This paper presents an extended version of the separation plane algorithms for subgradientbased finite-dimensional nondifferentiable convex blackbox optimization. The extension introduces additional cuts for epigraph of the conjugate of objective function which improve the convergence of the algorithm. The case of affine cuts is considered in more details and it is shown that it requires soluti...
متن کاملIntersection Cuts with Infinite Split Rank
We consider mixed integer linear programs where free integer variables are expressed in terms of nonnegative continuous variables. When this model only has two integer variables, Dey and Louveaux characterized the intersection cuts that have infinite split rank. We show that, for any number of integer variables, the split rank of an intersection cut generated from a rational lattice-free polyto...
متن کاملDynamic Ham-Sandwich Cuts of Convex Polygons in the Plane
We provide an efficient data structure for dynamically maintaining a ham-sandwich cut of two nonoverlapping convex polygons in the plane. Given two non-overlapping convex polygons P1 and P2 in the plane, the ham-sandwich cut of P1 and P2 is a line that simultaneously bisects the area (or perimeter or vertex count) of both polygons. We provide a data structure that supports queries for the ham-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Optimization
سال: 2021
ISSN: ['1095-7189', '1052-6234']
DOI: https://doi.org/10.1137/20m1324521